a method to calculate the minimum path sets between two nodes in a network 一种计算网络两点间最小路集的方法
combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic . in many research fields of multicast tree, many high-efficiency solutions were obtained in this paper . this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic ) 本篇论文对多播生成树问题进行了比较全面的讨论,涉及内容包括单约束的单树多播、单约束的成组多播等多个方面,所提出的动态最短路径树算法dmdt(dynamicminimumdistancetree),最小代价多播生成树算法fmph(fastminimumpathcostheuristic)动态最小代价多播生成树算法dmph(dynamicminimumpathcostheuristic),成组多播快速路由算法fgmra(fastgroupmulticastroutingarithmetic),都取得了显著的效果,是目前同类问题中比较好的解决方案,达到了预期的目的。
combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic . in many research fields of multicast tree, many high-efficiency solutions were obtained in this paper . this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic ) 本篇论文对多播生成树问题进行了比较全面的讨论,涉及内容包括单约束的单树多播、单约束的成组多播等多个方面,所提出的动态最短路径树算法dmdt(dynamicminimumdistancetree),最小代价多播生成树算法fmph(fastminimumpathcostheuristic)动态最小代价多播生成树算法dmph(dynamicminimumpathcostheuristic),成组多播快速路由算法fgmra(fastgroupmulticastroutingarithmetic),都取得了显著的效果,是目前同类问题中比较好的解决方案,达到了预期的目的。